On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs
نویسندگان
چکیده
An orthogonal drawing of a graph is a planar drawing where each edge is drawn as a sequence of horizontal and vertical line segments. Finding a bend-minimized orthogonal drawing of a planar graph of maximum degree 4 is NP-hard. The problem becomes tractable for planar graphs of maximum degree 3, and the fastest known algorithm takes O(n5 logn) time. Whether a faster algorithm exists has been a long-standing open problem in graph drawing. In this paper we present an algorithm that takes only Õ(n17/7) time, which is a significant improvement over the previous state of the art. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments
Inspired by the artwork of Mark Lombardi, we study the problem of constructing orthogonal drawings where a small number of horizontal and vertical line segments covers all vertices. We study two problems on orthogonal drawings of planar graphs, one that minimizes the total number of line segments and another that minimizes the number of line segments that cover all the vertices. We show that th...
متن کامل1-Bend Orthogonal Partial Edge Drawing
Recently, a new layout style to avoid edge crossings in straight-line drawings of non-planar graphs received attention. In a Partial Edge Drawing (PED), the middle part of each segment representing an edge is dropped and the two remaining parts, called stubs, are not crossed. To help the user inferring the position of the two end-vertices of each edge, additional properties like symmetry and ho...
متن کاملNo-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs
A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, c...
متن کاملNon-planar Orthogonal Drawings with Fixed Topology
This paper discusses the calculation of bend minimal shapes for non-planar graphs with given topology. Based on the Simple-Kandinsky drawing standard – a simplification of the more complex Kandinsky standard – we show the disadvantage of using standard models for this task: We show that the minimal bend count is suboptimal, when these models are applied to non-planar graphs; it is therefore ben...
متن کاملHigher-Degree Orthogonal Graph Drawing with Flexibility Constraints
Much work on orthogonal graph drawing has focused on 4-planar graphs, that is planar graphs where all vertices have maximum degree 4. In this work, we study aspects of the Kandinsky model, which is a model for orthogonal graph drawings of higher-degree graphs. First, we examine the decision problem β-Embeddability, which asks whether for a given planar graph with a fixed or variable embedding, ...
متن کامل